Randomized algorithm

Results: 630



#Item
431Gossip protocol / Network architecture / Coding theory / Randomized algorithm / Voronoi diagram / Random walk / Random graph / Routing / Belief propagation / Mathematics / Theoretical computer science / Graph theory

IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 56, NO. 3, MARCH[removed]Geographic Gossip: Efficient Averaging for Sensor Networks

Add to Reading List

Source URL: www.eecs.berkeley.edu

Language: English - Date: 2008-04-02 01:18:39
432Graphical models / Operations research / Belief propagation / Coding theory / Probability theory / Logarithm / Projection / Randomized algorithm / Dynamic programming / Mathematics / Mathematical analysis / Theoretical computer science

Journal of Machine Learning Research[removed]2835 Submitted 12/12; Revised 6/13; Published 9/13 Belief Propagation for Continuous State Spaces: Stochastic Message-Passing with Quantitative Guarantees

Add to Reading List

Source URL: www.eecs.berkeley.edu

Language: English - Date: 2013-10-28 23:54:24
433Random oracle / IP / NP / Randomized algorithm / RSA / Challenge-response authentication / Formal verification / Standard model / Cryptography / Public-key cryptography / Probabilistic complexity theory

Compact Proofs of Retrievability Hovav Shacham∗ [removed] Brent Waters† [removed]

Add to Reading List

Source URL: cseweb.ucsd.edu

Language: English - Date: 2012-09-27 16:18:47
434Combinatorial optimization / NP-complete problems / Cut / Graph connectivity / Graph partition / Connectivity / Matching / Minimum cut / Randomized algorithm / Graph theory / Mathematics / Theoretical computer science

Graph Partitioning using Single Commodity Flows Satish Rao Umesh Vazirani University of Waterloo,

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2007-01-02 19:10:42
435Randomness / Finite fields / Probabilistic complexity theory / Analysis of algorithms / Randomized algorithm / Fisher–Yates shuffle / Pseudorandomness / Bounded-error probabilistic polynomial / Information theory / Theoretical computer science / Applied mathematics / Mathematics

Efficiency Considerations in Using Semi-random Sources. (Extended Abstract) Umesh V. Vazirani Harvard University

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2004-09-11 21:09:07
436Auction theory / Auctioneering / Operations research / Game theory / Generalized second-price auction / Randomized algorithm / Algorithm / Linear programming / Online algorithm / Applied mathematics / Mathematics / Theoretical computer science

AdWords and Generalized On-line Matching Aranyak Mehta ∗ Amin Saberi

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2008-10-24 04:45:25
437Stochastic processes / Markov chain / Random walk / SL / Randomized algorithm / Loop-erased random walk / Theoretical computer science / Graph theory / Mathematics

A Markovian Extension of Valiant’s Learning Model (Extended Abstract) Umesh Vazirani t U.C.Berkeley David Aldous *

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2005-06-09 20:48:35
438Combinatorial optimization / Matching / Randomized algorithm / Rank / Matrix / Hungarian algorithm / Disjunct matrix / Mathematics / Theoretical computer science / Algebra

An Optimal Algorithm for On-line Bipartite Matching Richard M. Karp University of California at Berkeley & International Computer Science Institute Umesh V. Vazirani University of California at Berkeley

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2004-09-11 21:06:21
439Markov chain / Markov decision process / Randomized algorithm / PP / Additive Markov chain / Hidden Markov model / Statistics / Markov processes / Markov models

Symbolic Approximation of the Bounded Reachability Probability in Large Markov Chains Markus N. Rabe1 , Christoph M. Wintersteiger2 , Hillel Kugler2 , Boyan Yordanov2 , and Youssef Hamadi2 1

Add to Reading List

Source URL: www.winterstiger.at

Language: English - Date: 2014-07-21 09:40:00
440Cryptography / Theory of computation / Failure / Fault tolerance / Probabilistic complexity theory / Communications protocol / Byzantine fault tolerance / Randomized algorithm / IP / Mathematics / Theoretical computer science / Mathematical analysis

Byzantine Agreement in the Full-Information Model in O(log n) Rounds Michael Ben-Or∗ The Hebrew University Jerusalem, Israel [removed]

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2010-02-04 10:28:34
UPDATE